Connecting complex networks to nonadditive entropies

نویسندگان

چکیده

Boltzmann-Gibbs statistical mechanics applies satisfactorily to a plethora of systems. It fails however for complex systems generically involving strong space-time entanglement. Its generalization based on nonadditive $q$-entropies adequately handles wide class such We show here that scale-invariant networks belong this class. numerically study $d$-dimensional geographically located network with weighted links and exhibit its 'energy' distribution per site at quasi-stationary state. Our results strongly suggest correspondence between the random geometric problem thermal problems within generalised thermostatistics. The exponential factor is substituted by $q$-generalisation, recovered in $q=1$ limit when nonlocal effects fade away. present connection should cross-fertilise experiments both research areas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Coding Theorems for Nonadditive Generalized Mean-Value Entropies

We give an optimality characterization of nonadditive generalizedmean-value entropies from suitable nonadditive and generalized mean-value properties of the measure of average length. The results obtained cover many results obtained by other authors as particular cases, as well as the ordinary length due to Shannon 1948. Themain instrument is the l ni function of the word lengths in obtaining t...

متن کامل

Entropies for complex systems: generalized-generalized entropies

Many complex systems are characterized by non-Boltzmann distribution functions of their statistical variables. If one wants to – justified or not – hold on to the maximum entropy principle for complex statistical systems (non-Boltzmann) we demonstrate how the corresponding entropy has to look like, given the form of the corresponding distribution functions. By two natural assumptions that (i) t...

متن کامل

Entropies of complex networks with hierarchically constrained topologies.

The entropy of a hierarchical network topology in an ensemble of sparse random networks, with "hidden variables" associated with its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble. We obtain a general formula for this entropy, which has a clear interpretation in some simple limiting cases. The results provide keys with which to solve the general pro...

متن کامل

Nonadditive entropies yield probability distributions with biases not warranted by the data.

Different quantities that go by the name of entropy are used in variational principles to infer probability distributions from limited data. Shore and Johnson showed that maximizing the Boltzmann-Gibbs form of the entropy ensures that probability distributions inferred satisfy the multiplication rule of probability for independent events in the absence of data coupling such events. Other types ...

متن کامل

Connecting Core Percolation and Controllability of Complex Networks

Core percolation is a fundamental structural transition in complex networks related to a wide range of important problems. Recent advances have provided us an analytical framework of core percolation in uncorrelated random networks with arbitrary degree distributions. Here we apply the tools in analysis of network controllability. We confirm analytically that the emergence of the bifurcation in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2021

ISSN: ['2045-2322']

DOI: https://doi.org/10.1038/s41598-020-80939-1